Link Prediction Across Time via Cross-Temporal Locality Preserving Projections

نویسندگان

  • Satoshi Oyama
  • Kohei Hayashi
  • Hisashi Kashima
چکیده

Link prediction is the task of inferring the existence or absence of certain relationships among data objects such as identity, interaction, and collaboration. Link prediction is found in various applications in the fields of information integration, recommender systems, bioinformatics, and social network analysis. The increasing interest in dynamically changing networks has led to growing interest in a more general link prediction problem called temporal link prediction in the data mining and machine learning communities. However, only links among nodes at the same time point are considered in temporal link prediction. We propose a new link prediction problem called cross-temporal link prediction in which the links among nodes at different time points are inferred. A typical example of cross-temporal link prediction is cross-temporal entity resolution to determine the identity of real entities represented by data objects observed in different time periods. In dynamic environments, the features of data change over time, making it difficult to identify cross-temporal links by directly comparing observed data. Other examples of cross-temporal links are asynchronous communications in social networks such as Facebook and Twitter, where a message is posted in reply to a previous message. We adopt a dimension reduction approach to cross-temporal link prediction; that is, data objects in different time frames are mapped into a common low-dimensional latent feature space, and the links are identified on the basis of the distance between the data objects. The proposed method uses different low-dimensional feature projections in different time frames, enabling it to adapt to changes in the latent features over time. Using multi-task learning, it jointly learns a set of feature projection matrices from the training data, given the assumption of temporal smoothness of the projections. The optimal solutions are obtained by solving a single generalized eigenvalue problem. Experiments using a real-world set of bibliographic data for cross-temporal entity resolution and a real-world set of emails for unobserved asynchronous communication inference showed that introducing time-dependent feature projections improved the accuracy of link prediction. key words: link prediction, temporal data, entity resolution, social network analysis, dimension reduction

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gabor Based Optimized Discriminant Locality Preserving Projection for Feature Extraction and Recognition

This paper proposed a Gabor based optimized discriminant locality preserving projections (ODLPP) algorithm which can directly optimize discriminant locality preserving criterion on high-dimensional Gabor feature space via simultaneous diagonalization, without any dimensionality reduction preprocessing. Experimental results conducted on the VALID face database indicate the effectiveness of the p...

متن کامل

Optimized Discriminant Locality Preserving Projection of Gabor Feature for Biometric Recognition

Discriminant locality preserving projection(DLPP) can not obtain optimal discriminant vectors which utmostly optimize the objective of DLPP. This paper proposed a Gabor based optimized discriminant locality preserving projections (ODLPP) algorithm which can directly optimize discriminant locality preserving criterion on high-dimensional Gabor feature space via simultaneous diagonalization, with...

متن کامل

High Accuracy Human Activity Recognition Based on Sparse Locality Preserving Projections

Human activity recognition(HAR) from the temporal streams of sensory data has been applied to many fields, such as healthcare services, intelligent environments and cyber security. However, the classification accuracy of most existed methods is not enough in some applications, especially for healthcare services. In order to improving accuracy, it is necessary to develop a novel method which wil...

متن کامل

Exponential locality preserving projections for small sample size problem

Locality Preserving Projections (LPP) is a widely used manifold reduced dimensionality technique. However, it suffers from two problems: (1) Small Sample Size problem; (2)the performance is sensitive to the neighborhood size k. In order to address these problems, we propose an Exponential Locality Preserving Projections (ELPP) by introducing the matrix exponential in this paper. ELPP avoids the...

متن کامل

Face Recognition via Globality-Locality Preserving Projections

We present an improved Locality Preserving Projections (LPP) method, named Gloablity-Locality Preserving Projections (GLPP), to preserve both the global and local geometric structures of data. In our approach, an additional constraint of the geometry of classes is imposed to the objective function of conventional LPP for respecting some more global manifold structures. Moreover, we formulate a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEICE Transactions

دوره 95-D  شماره 

صفحات  -

تاریخ انتشار 2012